0.08/0.25	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.08/0.25	% Command    : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 240 THM
0.10/0.51	% Computer : n027.cluster.edu
0.10/0.51	% Model    : x86_64 x86_64
0.10/0.51	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.51	% Memory   : 8042.1875MB
0.10/0.51	% OS       : Linux 3.10.0-693.el7.x86_64
0.10/0.51	% CPULimit   : 1920
0.10/0.51	% WCLimit    : 240
0.10/0.51	% DateTime   : Wed Jul 30 05:23:34 EDT 2025
0.10/0.52	% CPUTime    : 
0.27/0.79	Running higher-order theorem proving
0.27/0.80	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox2/tmp/tmp.yDneySMCzR/E---3.1_24441.p
0.30/1.07	# Version: 3.0.0-ho
0.30/1.07	# Preprocessing class: HSMSSMSSMLLNHSN.
0.30/1.07	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.30/1.07	# Starting new_ho_10_cnf2 with 1200s (5) cores
0.30/1.07	# Starting post_as_ho3 with 240s (1) cores
0.30/1.07	# Starting new_ho_12 with 240s (1) cores
0.30/1.07	# Starting new_bool_2 with 240s (1) cores
0.30/1.07	# new_ho_10_cnf2 with pid 24519 completed with status 0
0.30/1.07	# Result found by new_ho_10_cnf2
0.30/1.07	# Preprocessing class: HSMSSMSSMLLNHSN.
0.30/1.07	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.30/1.07	# Starting new_ho_10_cnf2 with 1200s (5) cores
0.30/1.07	# No SInE strategy applied
0.30/1.07	# Search class: HGHNS-FFMF21-SHSSMFNN
0.30/1.07	# partial match(1): HGUNS-FFMF21-SHSSMFNN
0.30/1.07	# Scheduled 6 strats onto 5 cores with 1200 seconds (1200 total)
0.30/1.07	# Starting new_ho_10 with 649s (1) cores
0.30/1.07	# Starting new_ho_10_cnf2 with 121s (1) cores
0.30/1.07	# Starting ho_unfolding_6 with 109s (1) cores
0.30/1.07	# Starting sh4l with 109s (1) cores
0.30/1.07	# Starting ehoh_best_nonlift_rwall with 109s (1) cores
0.30/1.07	# ho_unfolding_6 with pid 24528 completed with status 0
0.30/1.07	# Result found by ho_unfolding_6
0.30/1.07	# Preprocessing class: HSMSSMSSMLLNHSN.
0.30/1.07	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.30/1.07	# Starting new_ho_10_cnf2 with 1200s (5) cores
0.30/1.07	# No SInE strategy applied
0.30/1.07	# Search class: HGHNS-FFMF21-SHSSMFNN
0.30/1.07	# partial match(1): HGUNS-FFMF21-SHSSMFNN
0.30/1.07	# Scheduled 6 strats onto 5 cores with 1200 seconds (1200 total)
0.30/1.07	# Starting new_ho_10 with 649s (1) cores
0.30/1.07	# Starting new_ho_10_cnf2 with 121s (1) cores
0.30/1.07	# Starting ho_unfolding_6 with 109s (1) cores
0.30/1.07	# Preprocessing time       : 0.002 s
0.30/1.07	
0.30/1.07	# Proof found!
0.30/1.07	# SZS status Theorem
0.30/1.07	# SZS output start CNFRefutation
0.30/1.07	thf(decl_sort1, type, mworld: $tType).
0.30/1.07	thf(decl_24, type, mactual: mworld).
0.30/1.07	thf(decl_25, type, mlocal: (mworld > $o) > $o).
0.30/1.07	thf(decl_27, type, mand: (mworld > $o) > (mworld > $o) > mworld > $o).
0.30/1.07	thf(decl_28, type, mor: (mworld > $o) > (mworld > $o) > mworld > $o).
0.30/1.07	thf(decl_29, type, mimplies: (mworld > $o) > (mworld > $o) > mworld > $o).
0.30/1.07	thf(decl_30, type, mequiv: (mworld > $o) > (mworld > $o) > mworld > $o).
0.30/1.07	thf(decl_33, type, mforall_di: ($i > mworld > $o) > mworld > $o).
0.30/1.07	thf(decl_37, type, equal_set: $i > $i > mworld > $o).
0.30/1.07	thf(decl_38, type, member: $i > $i > mworld > $o).
0.30/1.07	thf(decl_39, type, subset: $i > $i > mworld > $o).
0.30/1.07	thf(decl_46, type, union: $i > $i > $i).
0.30/1.07	thf(decl_48, type, esk1_0: $i).
0.30/1.07	thf(decl_49, type, esk2_2: $i > $i > $i).
0.30/1.07	thf(mlocal_def, axiom, ((mlocal)=(^[X1:mworld > $o]:((X1 @ mactual)))), file('/export/starexec/sandbox2/tmp/tmp.yDneySMCzR/E---3.1_24441.p', mlocal_def)).
0.30/1.07	thf(mimplies_def, axiom, ((mimplies)=(^[X2:mworld > $o, X4:mworld > $o, X3:mworld]:(((X2 @ X3)=>(X4 @ X3))))), file('/export/starexec/sandbox2/tmp/tmp.yDneySMCzR/E---3.1_24441.p', mimplies_def)).
0.30/1.07	thf(mequiv_def, axiom, ((mequiv)=(^[X2:mworld > $o, X4:mworld > $o, X3:mworld]:(((X2 @ X3)<=>(X4 @ X3))))), file('/export/starexec/sandbox2/tmp/tmp.yDneySMCzR/E---3.1_24441.p', mequiv_def)).
0.30/1.07	thf(mforall_di_def, axiom, ((mforall_di)=(^[X6:$i > mworld > $o, X3:mworld]:(![X7:$i]:((X6 @ X7 @ X3))))), file('/export/starexec/sandbox2/tmp/tmp.yDneySMCzR/E---3.1_24441.p', mforall_di_def)).
0.30/1.07	thf(mor_def, axiom, ((mor)=(^[X2:mworld > $o, X4:mworld > $o, X3:mworld]:(((X2 @ X3)|(X4 @ X3))))), file('/export/starexec/sandbox2/tmp/tmp.yDneySMCzR/E---3.1_24441.p', mor_def)).
0.30/1.07	thf(mand_def, axiom, ((mand)=(^[X2:mworld > $o, X4:mworld > $o, X3:mworld]:(((X2 @ X3)&(X4 @ X3))))), file('/export/starexec/sandbox2/tmp/tmp.yDneySMCzR/E---3.1_24441.p', mand_def)).
0.30/1.07	thf(subset_0, axiom, (mlocal @ (mforall_di @ (^[X35:$i]:(mforall_di @ (^[X36:$i]:(mequiv @ (subset @ X35 @ X36) @ (mforall_di @ (^[X7:$i]:(mimplies @ (member @ X7 @ X35) @ (member @ X7 @ X36)))))))))), file('/export/starexec/sandbox2/tmp/tmp.yDneySMCzR/E---3.1_24441.p', subset_0)).
0.30/1.07	thf(union_0, axiom, (mlocal @ (mforall_di @ (^[X7:$i]:(mforall_di @ (^[X61:$i]:(mforall_di @ (^[X62:$i]:(mequiv @ (member @ X7 @ (union @ X61 @ X62)) @ (mor @ (member @ X7 @ X61) @ (member @ X7 @ X62)))))))))), file('/export/starexec/sandbox2/tmp/tmp.yDneySMCzR/E---3.1_24441.p', union_0)).
0.30/1.07	thf(thI14, conjecture, (mlocal @ (mforall_di @ (^[X27:$i]:(equal_set @ (union @ X27 @ X27) @ X27)))), file('/export/starexec/sandbox2/tmp/tmp.yDneySMCzR/E---3.1_24441.p', thI14)).
0.30/1.07	thf(equal_set_0, axiom, (mlocal @ (mforall_di @ (^[X56:$i]:(mforall_di @ (^[X57:$i]:(mequiv @ (equal_set @ X56 @ X57) @ (mand @ (subset @ X56 @ X57) @ (subset @ X57 @ X56)))))))), file('/export/starexec/sandbox2/tmp/tmp.yDneySMCzR/E---3.1_24441.p', equal_set_0)).
0.30/1.07	thf(c_0_10, plain, ((mlocal)=(^[Z0/* 3 */:mworld > $o]:((Z0 @ mactual)))), inference(fof_simplification,[status(thm)],[mlocal_def])).
0.30/1.07	thf(c_0_11, plain, ((mimplies)=(^[Z0/* 19 */:mworld > $o, Z1:mworld > $o, Z2:mworld]:(((Z0 @ Z2)=>(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mimplies_def])).
0.30/1.07	thf(c_0_12, plain, ((mequiv)=(^[Z0/* 19 */:mworld > $o, Z1:mworld > $o, Z2:mworld]:(((Z0 @ Z2)<=>(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mequiv_def])).
0.30/1.07	thf(c_0_13, plain, ((mforall_di)=(^[Z0/* 19 */:$i > mworld > $o, Z1:mworld]:(![X7:$i]:((Z0 @ X7 @ Z1))))), inference(fof_simplification,[status(thm)],[mforall_di_def])).
0.30/1.07	thf(c_0_14, plain, ((mor)=(^[Z0/* 19 */:mworld > $o, Z1:mworld > $o, Z2:mworld]:(((Z0 @ Z2)|(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mor_def])).
0.30/1.07	thf(c_0_15, plain, ((mand)=(^[Z0/* 19 */:mworld > $o, Z1:mworld > $o, Z2:mworld]:(((Z0 @ Z2)&(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mand_def])).
0.30/1.07	thf(c_0_16, plain, ![X106:$i, X105:$i]:(((subset @ X106 @ X105 @ mactual)<=>![X104:$i]:(((member @ X104 @ X106 @ mactual)=>(member @ X104 @ X105 @ mactual))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[subset_0]), c_0_10]), c_0_11]), c_0_12]), c_0_13])).
0.30/1.07	thf(c_0_17, plain, ![X146:$i, X145:$i, X144:$i]:(((member @ X146 @ (union @ X145 @ X144) @ mactual)<=>((member @ X146 @ X145 @ mactual)|(member @ X146 @ X144 @ mactual)))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[union_0]), c_0_10]), c_0_14]), c_0_12]), c_0_13])).
0.30/1.07	thf(c_0_18, negated_conjecture, ~(![X92:$i]:((equal_set @ (union @ X92 @ X92) @ X92 @ mactual))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[thI14])]), c_0_10]), c_0_13])).
0.30/1.07	thf(c_0_19, plain, ![X136:$i, X135:$i]:(((equal_set @ X136 @ X135 @ mactual)<=>((subset @ X136 @ X135 @ mactual)&(subset @ X135 @ X136 @ mactual)))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[equal_set_0]), c_0_10]), c_0_15]), c_0_12]), c_0_13])).
0.30/1.07	thf(c_0_20, plain, ![X189:$i, X190:$i, X191:$i, X192:$i, X193:$i]:(((~(subset @ X189 @ X190 @ mactual)|(~(member @ X191 @ X189 @ mactual)|(member @ X191 @ X190 @ mactual)))&(((member @ (esk2_2 @ X192 @ X193) @ X192 @ mactual)|(subset @ X192 @ X193 @ mactual))&(~(member @ (esk2_2 @ X192 @ X193) @ X193 @ mactual)|(subset @ X192 @ X193 @ mactual))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])])])])])).
0.30/1.07	thf(c_0_21, plain, ![X237:$i, X238:$i, X239:$i]:(((~(member @ X237 @ (union @ X238 @ X239) @ mactual)|((member @ X237 @ X238 @ mactual)|(member @ X237 @ X239 @ mactual)))&((~(member @ X237 @ X238 @ mactual)|(member @ X237 @ (union @ X238 @ X239) @ mactual))&(~(member @ X237 @ X239 @ mactual)|(member @ X237 @ (union @ X238 @ X239) @ mactual))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])])).
0.30/1.07	thf(c_0_22, negated_conjecture, ~(equal_set @ (union @ esk1_0 @ esk1_0) @ esk1_0 @ mactual), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])])).
0.30/1.07	thf(c_0_23, plain, ![X228:$i, X229:$i]:(((((subset @ X228 @ X229 @ mactual)|~(equal_set @ X228 @ X229 @ mactual))&((subset @ X229 @ X228 @ mactual)|~(equal_set @ X228 @ X229 @ mactual)))&(~(subset @ X228 @ X229 @ mactual)|~(subset @ X229 @ X228 @ mactual)|(equal_set @ X228 @ X229 @ mactual)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])])).
0.30/1.07	thf(c_0_24, plain, ![X7:$i, X9:$i]:(((subset @ X7 @ X9 @ mactual)|~((member @ (esk2_2 @ X7 @ X9) @ X9 @ mactual)))), inference(split_conjunct,[status(thm)],[c_0_20])).
0.30/1.07	thf(c_0_25, plain, ![X7:$i, X10:$i, X9:$i]:(((member @ X7 @ (union @ X10 @ X9) @ mactual)|~((member @ X7 @ X9 @ mactual)))), inference(split_conjunct,[status(thm)],[c_0_21])).
0.30/1.07	thf(c_0_26, plain, ![X7:$i, X9:$i, X10:$i]:(((member @ X7 @ X9 @ mactual)|(member @ X7 @ X10 @ mactual)|~((member @ X7 @ (union @ X9 @ X10) @ mactual)))), inference(split_conjunct,[status(thm)],[c_0_21])).
0.30/1.07	thf(c_0_27, negated_conjecture, ~((equal_set @ (union @ esk1_0 @ esk1_0) @ esk1_0 @ mactual)), inference(split_conjunct,[status(thm)],[c_0_22])).
0.30/1.07	thf(c_0_28, plain, ![X9:$i, X7:$i]:(((equal_set @ X7 @ X9 @ mactual)|~((subset @ X7 @ X9 @ mactual))|~((subset @ X9 @ X7 @ mactual)))), inference(split_conjunct,[status(thm)],[c_0_23])).
0.30/1.07	thf(c_0_29, plain, ![X7:$i, X9:$i, X10:$i]:(((subset @ X7 @ (union @ X9 @ X10) @ mactual)|~((member @ (esk2_2 @ X7 @ (union @ X9 @ X10)) @ X10 @ mactual)))), inference(spm,[status(thm)],[c_0_24, c_0_25])).
0.30/1.07	thf(c_0_30, plain, ![X7:$i, X9:$i]:(((member @ (esk2_2 @ X7 @ X9) @ X7 @ mactual)|(subset @ X7 @ X9 @ mactual))), inference(split_conjunct,[status(thm)],[c_0_20])).
0.30/1.07	thf(c_0_31, plain, ![X7:$i, X9:$i]:(((member @ X7 @ X9 @ mactual)|~((member @ X7 @ (union @ X9 @ X9) @ mactual)))), inference(ef,[status(thm)],[c_0_26])).
0.30/1.07	thf(c_0_32, negated_conjecture, (~((subset @ esk1_0 @ (union @ esk1_0 @ esk1_0) @ mactual))|~((subset @ (union @ esk1_0 @ esk1_0) @ esk1_0 @ mactual))), inference(spm,[status(thm)],[c_0_27, c_0_28])).
0.30/1.07	thf(c_0_33, plain, ![X9:$i, X7:$i]:((subset @ X7 @ (union @ X9 @ X7) @ mactual)), inference(spm,[status(thm)],[c_0_29, c_0_30])).
0.30/1.07	thf(c_0_34, plain, ![X7:$i, X9:$i]:(((member @ (esk2_2 @ (union @ X7 @ X7) @ X9) @ X7 @ mactual)|(subset @ (union @ X7 @ X7) @ X9 @ mactual))), inference(spm,[status(thm)],[c_0_31, c_0_30])).
0.30/1.07	thf(c_0_35, negated_conjecture, ~((subset @ (union @ esk1_0 @ esk1_0) @ esk1_0 @ mactual)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32, c_0_33])])).
0.30/1.07	thf(c_0_36, plain, ![X7:$i]:((subset @ (union @ X7 @ X7) @ X7 @ mactual)), inference(spm,[status(thm)],[c_0_24, c_0_34])).
0.30/1.07	thf(c_0_37, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35, c_0_36])]), ['proof']).
0.30/1.07	# SZS output end CNFRefutation
0.30/1.07	# Parsed axioms                        : 70
0.30/1.07	# Removed by relevancy pruning/SinE    : 0
0.30/1.07	# Initial clauses                      : 78
0.30/1.07	# Removed in clause preprocessing      : 26
0.30/1.07	# Initial clauses in saturation        : 52
0.30/1.07	# Processed clauses                    : 1148
0.30/1.07	# ...of these trivial                  : 4
0.30/1.07	# ...subsumed                          : 397
0.30/1.07	# ...remaining for further processing  : 747
0.30/1.07	# Other redundant clauses eliminated   : 0
0.30/1.07	# Clauses deleted for lack of memory   : 0
0.30/1.07	# Backward-subsumed                    : 0
0.30/1.07	# Backward-rewritten                   : 2
0.30/1.07	# Generated clauses                    : 13042
0.30/1.07	# ...of the previous two non-redundant : 10214
0.30/1.07	# ...aggressively subsumed             : 0
0.30/1.07	# Contextual simplify-reflections      : 0
0.30/1.07	# Paramodulations                      : 13026
0.30/1.07	# Factorizations                       : 16
0.30/1.07	# NegExts                              : 0
0.30/1.07	# Equation resolutions                 : 0
0.30/1.07	# Disequality decompositions           : 0
0.30/1.07	# Total rewrite steps                  : 2785
0.30/1.07	# ...of those cached                   : 1213
0.30/1.07	# Propositional unsat checks           : 0
0.30/1.07	#    Propositional check models        : 0
0.30/1.07	#    Propositional check unsatisfiable : 0
0.30/1.07	#    Propositional clauses             : 0
0.30/1.07	#    Propositional clauses after purity: 0
0.30/1.07	#    Propositional unsat core size     : 0
0.30/1.07	#    Propositional preprocessing time  : 0.000
0.30/1.07	#    Propositional encoding time       : 0.000
0.30/1.07	#    Propositional solver time         : 0.000
0.30/1.07	#    Success case prop preproc time    : 0.000
0.30/1.07	#    Success case prop encoding time   : 0.000
0.30/1.07	#    Success case prop solver time     : 0.000
0.30/1.07	# Current number of processed clauses  : 745
0.30/1.07	#    Positive orientable unit clauses  : 173
0.30/1.07	#    Positive unorientable unit clauses: 0
0.30/1.07	#    Negative unit clauses             : 254
0.30/1.07	#    Non-unit-clauses                  : 318
0.30/1.07	# Current number of unprocessed clauses: 9118
0.30/1.07	# ...number of literals in the above   : 18730
0.30/1.07	# Current number of archived formulas  : 0
0.30/1.07	# Current number of archived clauses   : 2
0.30/1.07	# Clause-clause subsumption calls (NU) : 11958
0.30/1.07	# Rec. Clause-clause subsumption calls : 10462
0.30/1.07	# Non-unit clause-clause subsumptions  : 80
0.30/1.07	# Unit Clause-clause subsumption calls : 12294
0.30/1.07	# Rewrite failures with RHS unbound    : 0
0.30/1.07	# BW rewrite match attempts            : 411
0.30/1.07	# BW rewrite match successes           : 2
0.30/1.07	# Condensation attempts                : 1148
0.30/1.07	# Condensation successes               : 4
0.30/1.07	# Termbank termtop insertions          : 252352
0.30/1.07	# Search garbage collected termcells   : 4271
0.30/1.07	
0.30/1.07	# -------------------------------------------------
0.30/1.07	# User time                : 0.243 s
0.30/1.07	# System time              : 0.014 s
0.30/1.07	# Total time               : 0.257 s
0.30/1.07	# Maximum resident set size: 2636 pages
0.30/1.07	
0.30/1.07	# -------------------------------------------------
0.30/1.07	# User time                : 0.954 s
0.30/1.07	# System time              : 0.061 s
0.30/1.07	# Total time               : 1.015 s
0.30/1.07	# Maximum resident set size: 1840 pages
0.30/1.07	% E exiting
0.30/1.07	% E exiting
0.30/1.08	EOF